Enabling convergence of the iterated penalty Picard iteration with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e946" altimg="si2.svg"><mml:mrow><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math> penalty parameter for incompressible Navier–Stokes via Anderson acceleration

نویسندگان

چکیده

This paper considers an enhancement of the classical iterated penalty Picard (IPP) method for incompressible Navier-Stokes equations, where we restrict our attention to $O(1)$ parameter, and Anderson acceleration (AA) is used significantly improve its convergence properties. After showing fixed point operator associated with IPP iteration Lipschitz continuous continuously (Frechet) differentiable, apply a recently developed general theory AA conclude that enhanced improves linear rate by gain factor underlying optimization problem. Results several challenging numerical tests are given show parameter 1 very effective solver.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decrease of the Penalty Parameter in Differentiable Penalty Function Methods

We propose a simple modification to the differentiable penalty methods for solving nonlinear programming problems. This modification decreases the penalty parameter and the ill-conditioning of the penalty method and leads to a faster convergence to the optimal solution. We extend the modification to the augmented Lagrangian method and report some numerical results on several nonlinear programmi...

متن کامل

Convergence Analysis for Anderson Acceleration

Anderson(m) is a method for acceleration of fixed point iteration which stores m + 1 prior evaluations of the fixed point map and computes the new iteration as a linear combination of those evaluations. Anderson(0) is fixed point iteration. In this paper we show that Anderson(m) is locally r-linearly convergent if the fixed point map is a contraction and the coefficients in the linear combinati...

متن کامل

Adaptive ADMM with Spectral Penalty Parameter Selection

The alternating direction method of multipliers (ADMM) is a versatile tool for solving a wide range of constrained optimization problems, with differentiable or non-differentiable objective functions. Unfortunately, its performance is highly sensitive to a penalty parameter, which makes ADMM often unreliable and hard to automate for a non-expert user. We tackle this weakness of ADMM by proposin...

متن کامل

A Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming

In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a...

متن کامل

Optimal penalty parameter for C0 IPDG

We derive the lower bound of the penalty parameter in the C IPDG for the bi-harmonic equation. Based on the bound, we propose a pre-processing algorithm. Numerical example are shown to support the theory. In addition, we found that an optimal penalty does exist.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering

سال: 2021

ISSN: ['0045-7825', '1879-2138']

DOI: https://doi.org/10.1016/j.cma.2021.114178